Algorithms for quadratic constrained matrix problems
نویسندگان
چکیده
منابع مشابه
Subspace Accelerated Matrix Splitting Algorithms for Bound-constrained Quadratic Programming and Linear Complementarity Problems
This paper studies the solution of two problems—bound-constrained quadratic programs and linear complementarity problems—by two-phase methods that consist of an active set prediction phase and a subspace phase. The algorithms enjoy favorable convergence properties under weaker assumptions than those assumed for other methods in the literature. The active set prediction phase employs matrix spli...
متن کاملGlobal Optimization Algorithms for Linearly Constrained Indefinite Quadratic Problems
1. I N T R O D U C T I O N Global optimization of constrained quadratic problems has been the subject of active research during the last two decades. Quadratic programming is a very old and important problem of optimization. It has numerous applications in many diverse fields of science and technology and plays a key role in many nonlinear programming methods. Nonconvex quadratic programming re...
متن کاملAlgorithms for Solving Nonconvex Block Constrained Quadratic Problems
Non-convex Quadratically Constrained Quadratic Programs with block-separable convex constraints are generally NP-hard. These problems appear in many applications such as estimation and control, complex unimodular programming, and MAX-CUT type problems. SDP relaxation is the best known upper bound approximation for this problem. We suggest the Block Optimal Ascent (BOA) algorithm to obtain lower...
متن کاملHaar Matrix Equations for Solving Time-Variant Linear-Quadratic Optimal Control Problems
In this paper, Haar wavelets are performed for solving continuous time-variant linear-quadratic optimal control problems. Firstly, using necessary conditions for optimality, the problem is changed into a two-boundary value problem (TBVP). Next, Haar wavelets are applied for converting the TBVP, as a system of differential equations, in to a system of matrix algebraic equations...
متن کاملAlgorithms for Quadratic Fractional Programming Problems
Consider the nonlinear fractional programming problem max{f(x)lg(x)lxES}, where g(x»O for all XES. Jagannathan and Dinkelbach have shown that the maximum of this problem is equal to ~O if and only if max{f(x)-~g(x) IXES} is 0 for ~=~O. 1 t t Based on this result, we treat here a special case: f(x)=Zx Cx+r x+s, g(X)=~ xtDX+ptX+q and S is a polyhedron, where C is negative definite and D is positi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1992
ISSN: 0895-7177
DOI: 10.1016/0895-7177(92)90119-6